Betweenness parameterized above tight lower bound
نویسندگان
چکیده
منابع مشابه
Betweenness parameterized above tight lower bound
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...
متن کاملOrdinal Embedding Relaxations Parameterized Above Tight Lower Bound
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...
متن کاملA Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by Mahajan, Raman and Sikdar (J. Comput. Syst. Sci. 75, 2009). We show that a generalization of one of the problems and non-trivial special cases of the other tw...
متن کاملMaximum Balanced Subgraph Problem Parameterized above Lower Bound
We consider graphs without loops or parallel edges in which every edge is assigned + or −. Such a signed graph is balanced if its vertex set can be partitioned into parts V1 and V2 such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign − (one of the parts may be empty). It is well-known that every connected signed graph with...
متن کاملSolving MAX-2-SAT Above a Tight Lower Bound
We present an exact algorithm that decides in time m + 2 ) whether a given set of m binary clauses admits a truth assignment that satisfies at least (3m + k)/4 clauses. Thus Max-2-Sat is fixed-parameter tractable when parameterized above the tight lower bound 3m/4. Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent one with O(k)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2010
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2010.05.001